Methods and systems for performing short integer chen IDCT algorithm with fused multiply/add

ABSTRACT

Methods and apparatus for performing a fast two-dimensional inverse discrete cosine transform (IDCT) in a media processor are disclosed. A processor receives at least one input component representing discrete cosine transform data and combines, in a first stage, the at least one input component with a first set of constants. In a media processor with a partitioned SIMD architecture, the input data and first set of constants may be combined, for example, by multiplying the at least one input component with a first set of constants using a complex multiplication instruction. The output is transposed in a second stage and combined with constants in a third stage.

BACKGROUND OF THE INVENTION

[0001] The present invention relates generally to media processors, and in particular, is directed to methods and systems for performing the faster two-dimensional inverse discrete cosine transforms (IDCT) in media processors.

[0002] A “media processor” is a type of computer which capable of processing video and audio signals. The market demand for fast media processors has increased with the demand for popular entertainment and consumer electronic goods. Typically, multimedia applications handle video and audio signs in real time and are often slow to execute. Media processors, therefore, are often specially designed for a particular application. Conventional media processors, for example, may have such features as a partitioned Single Instruction, Multiple Data (SIMD) architecture, custom instruction set, and wide registers to efficiently perform signal processing of image data. Another technique for improving media processors is to specially design the media processor to perform frequently required, time-intensive operations more efficiently

[0003] Discrete cosine transforms (DCT) and inverse discrete cosine transform (IDCT) are widely used operations in the signal processing of image data. Both are used, for example, in the international standards for moving picture video compression put forth by the Motion Picture Experts Group (MPEG). DCT has certain properties that produce simplified and efficient coding models. When applied to a matrix of pixel data, the DCT is a method of decomposing a block of data into a weighted sum of spatial frequencies, or DCT coefficients. Conversely, the IDCT is used to transform a matrix of DCT coefficients back to pixel data.

[0004]FIG. 1 is a basic flow diagram showing the encoding and decoding processes of a prior art digital video (DV) codec. DV codecs are one example of a device using a DCT-based data compression method. In the blocking stage, the image frame is divided into N by N blocks of pixel information including, for example, brightness and color data for each pixel (stage 100). A common block size is eight pixels horizontally by eight pixels vertically. The pixel blocks are then “shuffled” so that several blocks from different portions of the image are grouped together (stage 110). Shuffling enhances the uniformity of image quality.

[0005] Different fields are recorded at different time incidents. For each block of pixel data, a motion detector looks for the difference between two fields of a frame (stage 115). The motion information is sent to the next processing stage (stage 120). In stage 120, pixel information is transformed using a DCT. An 8-8 DCT, for example, takes eight inputs and returns eight outputs in both vertical and horizontal directions. The resulting DCT coefficients are then weighted by multiplying each block of DCT coefficients by weighting constants (stage 125).

[0006] The weighted DCT coefficients are quantized in the next stage (stage 140). Quantization rounds off each DCT coefficient within a certain range of values to be the same number (stage 140). Quantizing tends to set the higher frequency components of the frequency matrix to zero, resulting in much less data to be stored. Since the human eye is most sensitive to lower frequencies, however, very little perceptible image quality is lost by this stage.

[0007] Quantization stage 140 includes converting the two-dimensional matrix of quantized coefficients to a one-dimensional linear stream of data by reading the matrix values in a zigzag pattern and dividing the one-dimensional linear stream of quantized coefficients into segments, where each segment consists of a string of zero coefficients followed by a non-zero quantized coefficient. Variable length coding (VLC) then is performed by transforming each segment, consisting of the number of zero coefficients and the amplitude of the non-zero coefficient in the segment, into a variable length codeword (stage 145). Finally, a framing process packs every 30 blocks of variable-length coded quantized coefficients into five fixed-length synchronization blocks (stage 150).

[0008] The lower portion of FIG. 1 shows a basic flow diagram of a prior art DV codec decoding process. Decoding is essentially the reverse of the encoding process described above. The digital stream is first deframed (stage 155). Variable length decoding (VLD) then unpacks the data so that it may be restored to the individual coefficients (stage 160).

[0009] After inverse quantizing the coefficients (stage 165), inverse weighting (stage 170) and an inverse discrete cosine transform (IDCT) (stage 175) are applied to the result. The inverse weights are the multiplicative inverses of the weights that were applied in the encoding process. The output of the inverse weighting function is then processed by the IDCT. The IDCT operation may be described mathematically using the following formula: $f_{uv} = {\frac{2}{N}{\sum\limits_{m = 0}^{N - 1}{\sum\limits_{n = 0}^{N - 1}{{c(u)}{c(v)}F_{mn}\cos \quad \left( \frac{\left( {{2u} + 1} \right)m\quad \pi}{2N} \right)\cos \quad \left( \frac{\left( {{2v} + 1} \right)n\quad \pi}{2N} \right)}}}}$

[0010] where F_(N×N) is an input matrix of DCT coefficients of size N by N, f_(N×N) is a output matrix of pixel information of size N by N, and c(u) and c(v) are matrices of constants as defined below. $\begin{matrix} {(k) = \begin{matrix} \frac{1}{\sqrt{2}} & {{if}\quad \left( {k = 0}\quad \right.} \end{matrix}} \\ \begin{matrix} {\quad 1} & {\quad {{if}\quad \left( {k \neq 0} \right.}} \end{matrix} \end{matrix}$

[0011] The result is then deshuffled (stage 180) and deblocked (stage 185) to form the full image frame.

[0012] Because the DCT and IDCT are widely used, much attention has been devoted to developing fast algorithms for implementing them. Furthermore, there exist many different, but mathematically equivalent, hardware and software implementations for computing the DCT and IDCT. For example, the IDCT equation above can also be written matrix notation as:

[f _(N×N) ]=[A _(N×N)]^(T) [F _(N×N) ][A _(N×N)]  (Equation 1)

[0013] where [A_(N×N)] is a N×N constant matrix. By applying simple rules of matrix multiplication, two mathematically equivalent matrix notation equations may be derived from Equation 1 as shown below.

[f _(N×N) ]=[A _(N×N)]^(T) ([A _(N×N)]^(T) [F _(N×N)]^(T))^(T)  (Equation 2)

[f _(N×N) ]=M([A _(N×N)]^(T) {circle over (×)}[A _(N×N)]^(T) L([F _(N×N)]^(T)))  (Equation 3)

[0014] where L is an operation that converts an N×N matrix to a vector according to the equation L([X₂₂])=[x₀₀ x₀₁ x₁₀ x₁₁], M is an operation that converts a vector into a matrix according to the equation [X₂₂]=M([x₀₀ x₀₁ x₁₀ x₁₁]), and the symbol {circle over (×)} indicates a tensor product. The tensor product of [X₂₂]{circle over (×)}[Y₂₂] is defined as, ${\left\lbrack X_{22} \right\rbrack \otimes \left\lbrack Y_{22} \right\rbrack} = \begin{bmatrix} {X_{00}Y_{00}} & {X_{00}Y_{01}} & {X_{01}Y_{00}} & {X_{01}Y_{01}} \\ {X_{00}Y_{10}} & {X_{00}Y_{11}} & {X_{01}Y_{10}} & {X_{01}Y_{11}} \\ {X_{10}Y_{00}} & {X_{10}Y_{01}} & {X_{11}Y_{00}} & {X_{11}Y_{01}} \\ {X_{10}Y_{10}} & {X_{10}Y_{11}} & {X_{11}Y_{10}} & {X_{11}Y_{11}} \end{bmatrix}$

[0015] Equation 2 demonstrates that a two-dimensional IDCT may be computed by multiplying the input data matrix (F) by the constant matrix (A), transposing the result, and then multiplying the transposed matrix by the constant matrix (A). Algorithms that compute two-dimensional IDCTs in this manner are called “type I” algorithms. Type I algorithms are easy to implement on a parallel machine, that is, a computer formed of a plurality of processors operating simultaneously in parallel. For example, when using N parallel processors to perform a matrix multiplication on N×N matrices, N column multiplies can be simultaneously performed. Additionally, a parallel machine can be designed so as to contain special hardware or software instructions for performing fast matrix transposition.

[0016] One disadvantage of type I algorithms is that more multiplications are needed. The computation sequence of type I algorithms involves two matrix multiplies separated by a matrix transposition which, if N=4, for example, requires 64 additions and 48 multiplications for a total number of 112 instructions. It is well known by those skilled in the art that multiplications are very time-consuming for processors to perform and that system performance is often optimized by reducing the number of multiplications performed.

[0017] Equation 3 above demonstrates that the result of a two-dimensional IDCT can also be obtained by converting the transpose of the input matrix into a one-dimensional vector using the L function. Next, the tensor product [A_(N×N)]{circle over (×)}[A_(N×N)] of constant matrix [A_(N×N)] is obtained. Tensor product [A_(N×N)]{circle over (×)}[A_(N×N)] is then multiplied by the one-dimensional vector, L([F_(N×N)]). The result is converted back into an N×N matrix using the M function. Assuming again that N=4, the total number of instructions used by this computational sequence is 92 instructions (68 additions and 24 multiplications). Algorithms that perform two-dimensional IDCTs using this computational sequence are called “type II” algorithms. In type II algorithms, the two constant matrices are grouped together and performed as one operation. The advantage of type II algorithms is that they typically require fewer instructions (92 versus 112) and, in particular, fewer costly multiplications (24 versus 48). Type II algorithms, however, are very difficult to implement efficiently on a parallel machine. Type II algorithms tend to reorder the data very frequently and reordering data on a parallel machine is very time-intensive.

[0018] There exist numerous type I and type II algorithms for implementing IDCTs, however, all suffer from disadvantages that make them inefficient for use in a media processor. As explained above, media processors built using type I algorithms achieve some efficiencies from parallel processing but require too many instructions and, in particular, multiplications. Media processors built using type II algorithms require fewer instructions but cannot be further improved using parallel processing.

[0019] The present invention improves the efficiency of implementing an IDCT algorithm by providing methods and apparatus that minimize the number of required instructions. The present invention also provides methods and apparatus for decreasing the number of multiplications without reordering the data thereby allowing efficient implementation on a parallel machine.

SUMMARY OF THE INVENTION

[0020] Methods for performing a two-dimensional inverse discrete cosine transform consistent with this invention comprise stages performed by a processor. A processor receives at least one input component representing discrete cosine transform data and combines, in a first stage, the at least one input component with a first set of constants. The input data and first set of constants may be combined, for example, by multiplying the at least one input component with a first set of constants using a complex multiplication instruction. The output is transposed in a second stage and combined with constants in a third stage.

[0021] Furthermore, an IDCT apparatus consistent with the present invention comprises an input means, a memory, at least one circuit, and an output means. The input means receives at least one input component representing discrete cosine transform data. The memory stores a first and second set of constants. The at least one circuit combines the input components with the constants in a first stage, transposes the output data, and combines the transposed first-stage output data with the second set of constants in a third stage. The circuit means may comprise, for example, a means for multiplying the at least one input component with a first set of constants using a complex multiplication instruction. The output means for outputting output components representing pixel information of an image.

BRIEF DESCRIPTION OF THE DRAWINGS

[0022] The accompanying drawings, which are incorporated in and constitute a part of this specification, illustrate the invention and, together with the description, serve to explain the principles of the invention.

[0023]FIG. 1 is a flow diagram of a prior art digital video encoder and decoder;

[0024]FIG. 2 is a flow diagram illustrating a prior art method for computing an IDCT;

[0025]FIG. 3 is an example of matrix, H, which equals the tensor product I{circle over (×)}V;

[0026]FIG. 4 is an example of matrix, G, which equals the tensor product Ve{circle over (×)}I;

[0027]FIG. 5 is a flow diagram illustrating a method for computing an IDCT consistent with the present invention;

[0028]FIG. 6 is a diagram illustrating an operation as performed by a processor with partitioned SIMD architecture;

[0029]FIG. 7 is a diagram showing a complex multiplication as executed on a partitioned SIMD architecture;

[0030]FIG. 8 is a diagram showing the use of a partitioned SIMD architecture in implementing principles consistent with the present invention;

[0031]FIG. 9 is a flow diagram illustrating a method for computing an IDCT consistent with the present invention;

[0032]FIG. 10 is a diagram showing the use of a partitioned SIMD architecture in implementing principles consistent with the present invention;

[0033]FIG. 11 is a signal flow diagram (also known as a “butterfly diagram”) of a fast IDCT algorithm to be performed by the IDCT apparatus of the present invention.;

[0034]FIG. 12 shows an apparatus for carrying out a method consistent with the present invention; and

[0035]FIG. 13 shows a block diagram of an exemplary multiprocessor computer system in which application programs written in a manner consistent with the present invention may be implemented.

DESCRIPTION OF THE PREFERRED EMBODIMENTS

[0036] Reference will now be made in detail to preferred implementations consistent with the present invention, an example of which is illustrated in the accompanying drawings. Wherever possible, the same reference numbers will be used throughout the drawings and the following description to refer to the same or like parts.

[0037] A. Introduction

[0038] Methods, systems, and articles of manufacture consistent with the present invention include a method of performing a two-dimensional IDCT algorithm that reduces the number of necessary multiplications over other commonly available methods. This method keeps the basic computational sequence of type I algorithms and, therefore, also retains the implementation advantages of type I algorithms. This method retains some of the advantages of type II algorithms by using a type II approach to perform the multiplication of constants.

[0039] B. Method

[0040] The present invention achieves efficiencies in part by collecting the majority of multiplications performed in calculating an IDCT into one matrix. Multiplications involving this matrix may then be implemented efficiently by using specially equipped media processors.

[0041] Mathematically, multiplications may be collected together by capitalizing on the properties of tensor products. As described above, an IDCT may be computed using a type II algorithm of the following form:

[f _(N×N) ]=M([A _(N×N)]^(T) {circle over (×)}[A _(N×N)]^(T) L([F _(N×N)]^(T)))  (Equation 3)

[0042] where F_(N×N) is an input matrix of DCT coefficients of size N by N, f_(N×N) is a output matrix of pixel information of size N by N, and [A_(N×N)] is a N×N constant matrix. In equation 3, the function L converts a two-dimensional vector to a one-dimensional vector. In a type II algorithm such as Equation 3, efficiency is gained in part by computing the two-dimensional IDCT as a one-dimensional IDCT.

[0043] Implementations of the computational sequence of Equation 3 may be improved by reducing the number of multiplications necessary to perform the tensor product [A_(N×N)]{circle over (×)}[A_(N×N)]. Mathematically, the constant matrix [A_(N×N)] may be decomposed into [U_(N×N)][V_(N×N)]. Decomposition of a tensor product can be accomplished by decomposing the input matrix into two factor matrices. For example, if [K]=[X][Y], then the decomposition of the tensor product is as follows:

[K]{circle over (×)}[K]=([X]{circle over (×)}[X])([Y]{circle over (×)}[Y])

[0044] Similarly, the tensor product [A_(N×N)]{circle over (×)}[A_(N×N)] may be decomposed into

[0045]

[A _(N×N) ]{circle over (×)}[A _(N×N)]=([U _(N×N) ] [V _(N×N)]){circle over (×)}([U _(N×N) ] [V _(N×N)]) =([U _(N×N) ]{circle over (×)}[U _(N×N)])([V _(N×N) ]{circle over (×)}[V _(N×N)]) =([U _(N×N) ]{circle over (×)}[U _(N×N)])([VV _(N×NN×N)])

[0046] where matrix [U_(N×N)] is a matrix where all the elements are either 1, 0, or −1, that is, a unity matrix. Since all the elements of matrix [U_(N×N)] are either 1, 0, or −1, multiplication by [U_(N×N)] effectively requires only addition or subtraction. Computing the constant matrix [VV_(N×N N×N)] therefore involves the majority of the multiplication operations.

[0047] Next, multiplication operations in type II algorithms may be consolidated by substituting the unity matrix [U_(N×N)] and the constant matrix [VV_(N×N N×N)] into a type II equation like Equation 3 in place of the tensor product [A_(N×N)]{circle over (×)}[A_(N×N)]. By replacing the tensor product [A_(N×N)]{circle over (×)}[A_(N×N)] with ([U_(N×N)]{circle over (×)}[U_(N×N)])([V_(N×N)]{circle over (×)}[V_(N×N)]), Equation 3 equals the following:

[f _(N×N) ]=M((([U _(N×N) ]{circle over (×)}[U _(N×N)]){circle over (×)}([VV _(N×NN×N)])) L([F _(N×N)]^(T)))

[0048] which may be factored into:

[f _(N×N) ]=[U _(N×N)]^(T)([U _(N×N)]^(T)(M([VV _(N×N,N×N) ]L([F _(N×N)]^(T)))^(T))^(T)  Equation 4

[0049] In Equation 4, most of the multiplication stages take place when VV is multiplied by the vector L([F_(N×N)]^(T)). Consistent with the present invention, multiplication is done predominantly in one stage thereby reducing the accumulated error due to multiplication to a minimum. As will be shown later, it is then possible to use fewer bits for temporary variables and, as a result, more data can be packed into one register.

[0050]FIG. 2 is a flowchart showing the stages for computing pixel information from an input matrix of DCT coefficients of size N×N using Equation 4 as shown above. First, DCT coefficients, [F_(N×N)], are received (stage 210) and transposed to obtain [F_(N×N)]^(T) (stage 220). The transpose of the input matrix of DCT coefficients is converted to a one-dimensional vector using the function L([X_(NN)])=[x₀₀ x₀₁ x₁₀ x₁₁], for N=0 to 1 (stage 225). The one-dimensional vector result is then multiplied with [V_(N×N,N×N)], a matrix containing constants (stage 230). The result is will be a one-dimensional vector of length N×N.

[0051] The one-dimensional vector result is then converted into a matrix using M, an operation that converts a vector into a matrix according to the equation [X₂₂]=M([x₀₀ x₀₁ x₁₀ x₁₁]) (stage 240). The result is then multiplied by the transpose of the unity matrix, U, which contains as entries only 1, 0, or −1 (stage 250). Multiplication by U, therefore, may by accomplished by addition and subtraction. The result is then transposed (stage 255) and multiplied a second time by the transpose of the unity matrix, U, to obtain a matrix of pixel information (stage 260).

[0052] In one embodiment of the present invention, faster techniques for computing a one-dimensional IDCT are used. For example, in their paper entitled “A Fast Computational Algorithm for the Discrete Cosine Transform,” IEEE Transactions on Communications, Vol. Com-25, No. 9, September 1977, pp.1004-09, the authors describe one such method. In the present invention, faster methods for performing the one-dimensional IDCT are combined with the principles of type II algorithms to achieve further improvement. To illustrate the principles of the present invention, begin with the formula for a type II algorithm, as shown below.

[f _(N×N) ]=M([A _(N×N)]^(T) {circle over (×)}[A _(N×N)]^(T) L([F _(N×N)]^(T)))  (Equation 3)

[0053] Mathematically, it is known that the constant matrix [A_(N×N)] may be written in recursive format as: $\left\lbrack A_{N \times N} \right\rbrack = {{\left\lbrack P_{N \times N} \right\rbrack \quad\begin{bmatrix} \left\lbrack {\frac{A_{N}}{2} \times \frac{N}{2}} \right\rbrack & 0 \\ 0 & \left\lbrack {\frac{R_{N}}{2} \times \frac{N}{2}} \right\rbrack \end{bmatrix}}\left\lbrack B_{N \times N} \right\rbrack}$

[0054] where P_(N×N) is an N×N permutation matrix which permutes the transformed vector from bit reversed order to a natural bit order. If a vector in natural bit order contains the elements 00, 01, 10, 11, for example, the same vector in bit reversed order will contain the elements 00, 10, 01, 11. If N=4, then the equation above is equivalent to the following: $\left\lbrack A_{4 \times 4} \right\rbrack = {{\left\lbrack P_{4 \times 4} \right\rbrack \quad\begin{bmatrix} \left\lbrack A_{2 \times 2} \right\rbrack & 0 \\ 0 & \left\lbrack R_{2 \times 2} \right\rbrack \end{bmatrix}}\left\lbrack B_{4 \times 4} \right\rbrack}$

[0055] which is mathematically equivalent to: $\left\lbrack A_{4 \times 4} \right\rbrack^{T} = {{\left\lbrack B_{4 \times 4} \right\rbrack \quad\begin{bmatrix} \left\lbrack A_{2 \times 2} \right\rbrack & 0 \\ 0 & \left\lbrack R_{2 \times 2} \right\rbrack \end{bmatrix}}^{T}\left\lbrack P_{4 \times 4} \right\rbrack}^{T}$

[0056] Since multiplication by [P_(N×N)]^(T) merely reorders the input data, it can be performed in a previous or subsequent stage and ignored here. As shown earlier, the constant matrix A can then be factored into matrices U and V such that $\left\lbrack A_{4 \times 4} \right\rbrack = {{\left\lbrack U_{4 \times 4} \right\rbrack \quad\left\lbrack V_{4 \times 4} \right\rbrack} = {\left\lbrack B_{4 \times 4} \right\rbrack^{T}\begin{bmatrix} \left\lbrack A_{2 \times 2} \right\rbrack & 0 \\ 0 & \left\lbrack R_{2 \times 2} \right\rbrack \end{bmatrix}}^{T}}$

[0057] where U equals a matrix whose elements are 0, 1, and −1 such as, for example, the matrix U shown below. $\left\lbrack U_{4 \times 4} \right\rbrack = \begin{bmatrix} 1 & 0 & 0 & {- 1} \\ 0 & 1 & {- 1} & 0 \\ 0 & 1 & 1 & 0 \\ 1 & 0 & 0 & 1 \end{bmatrix}$

[0058] and V is a matrix containing constant values such as, for example, the matrix V shown below. $\left\lbrack V_{4 \times 4} \right\rbrack = \begin{bmatrix} \frac{1}{\sqrt{2}} & {- \frac{1}{\sqrt{2}}} & 0 & 0 \\ \frac{1}{\sqrt{2}} & \frac{1}{\sqrt{2}} & 0 & 0 \\ 0 & 0 & {\cos \quad \frac{\pi}{8}} & {{- \cos}\quad \left( \frac{3\pi}{8} \right)} \\ 0 & 0 & {\cos \left( \frac{3\pi}{8} \right)} & {\cos \left( \frac{3\pi}{8} \right)} \end{bmatrix}$

[0059] As a result, multiplication by matrix [V_(4×4)] requires multiplication by constant values, however, multiplication by matrix [U_(4×4)] may be accomplished using only addition operations. If U and V are substituted into a type II algorithm like Equation 3, then Equation 3 becomes:

[f _(4×4) ]=[U _(4×4)]^(T)([U _(4×4)]^(T) M([VV _(4×4,4×4) ]L([P _(4×4)]^(T) [F _(4×4)]^(T)))^(T))^(T)  Equation 5

[0060] where [VV_(4×4,4×4)] equals the tensor product [V_(N×N) ]{circle over (×)}[V _(N×N)]. Using the decomposition technique described above, [VV_(4×4,4×4)] can be decomposed according to the following:

[0061]  VV _(4×4,4×4)]=([V _(4×4) ][I _(4×4)]){circle over (×)}([I _(4×4) ][V _(4×4)])=([V _(4×4) ]{circle over (×)}[I _(4×4)])([I _(4×4) ]{circle over (×)}[V _(4×4)]

[0062]

[0063] where I_(4×4) is a 4 by 4 identity matrix containing all zero entries except for ones along the diagonal. Using the constant matrix, V, above as an example, the tensor product of the identity matrix, I, with V is a matrix, H, of constants as is shown in FIG. 3. The tensor product [V_(N×N)]{circle over (×)}[I_(N×N)] equals with equals a matrix, G, an example of which is shown in FIG. 4. [VV_(4×4,4×4)] equals the product of G and H. Substituting G and H into Equation 5 results in the following equation:

[f _(4×4) ]=[U _(4×4)]^(T)([U _(4×4)]^(T) M([G _(4×4,4×4) ][H _(4×4,4×4) ]L([P _(4×4)]^(T) [F _(4×4)]^(T)))^(T))^(T)  Equation 6

[0064] Equation 6 may be implemented using a media processor with partitioned SIMD architecture. FIG. 5 is a flowchart showing the stages for computing pixel information from an input matrix of DCT coefficients of size N×N using a method consistent with the present invention. First, the DCT coefficients are received (stage 510). The transpose of the input matrix of DCT coefficients, F, is reordered by multiplying F by the matrix, P (stage 520). If the DCT coefficients received in stage 510 are reordered before being received, the method proceeds with stage 530.

[0065] Next, the reordered DCT coefficients are multiplied by the constant matrix [H_(N×N)] (stage 530). In embodiments consistent with the present invention, this multiplication is performed on a media processor with a partitioned SIMD architecture. In a processor with partitioned SIMD architecture, two or more values may be packed into one register. As shown in FIG. 6, values a₀, a₁, . . . a₇ are packed into register A and values b₀, b₁, . . . b₇ are packed into register B. An instruction such as add (a, b, c) will add the contents of register A to the contents of register B and store the results in register C. C then contains the values a₀+b₀, a₁+b₁, . . . a₇+b₇.

[0066]FIG. 6 shows the addition of two registers containing multiple values, but other mathematical operations may be performed in a similar manner. There may exist, for example, a single instruction that directs a processor to multiply Register A in FIG. 6 by Register B and store the result in Register C. The contents of Register C would then contain, for example, a₀*b₀, a₁*b₁, . . . , a_(n)*b_(n).

[0067] Many media processors with a partitioned SIMD architecture contain an instruction for performing complex multiplication using one instruction. Complex multiplication is defined as the multiplication of two complex numbers, each number containing a real and imaginary part. For example, if

A=Areal+i * Aimage

B=Breal+i * Bimage

[0068] then to compute C=Creal+i*Cimage, the following two operations are performed.

Creal=Areal * Breal−Aimage * Bimage

Cimage=Areal * Bimage+Aimage * Breal

[0069] Creal equals the product of the first parts minus the product of the second parts. Cimage equals the produce of the first parts plus the product of the second parts. In a conventional media processor with a complex instruction capability, Creal and Cimage are computed using one instruction, even though four multiplications and two additions are performed. FIG. 7 shows the complex multiplication instruction as executed by a partitioned SIMD architecture.

[0070]FIG. 8 illustrates use of a partitioned SIMD architecture in implementing the multiplication of F by H as is consistent with the present invention. H_(ij) and −H_(ij+1) may be packed into register 810 while F_(u,v) and F_(u+1,v) are packed into register 820. The contents of register 810 and register 820 are combined and the result is stored in register 830. In a media processor containing a single instruction for performing complex multiplication, H and F may be combined using a single complex instruction. As displayed in register 830, the first part of register 830 contains the product of the first parts of registers 810 and 820 minus the product of the second parts. The second part of register 830 contains the product of the first parts plus the products of the second parts. Multiplication by the matrix [H_(N×N)] in this manner, as shown in FIG. 8, can be done using 16 operations.

[0071] The result from stage 530 (FIG. 5), stored in register 830 (FIG. 8), is then multiplied by [G_(N×N)] (stage 540). As earlier, G_(i,j) and G_(i+1j+1) can be packed into one register 840. The contents of register 840 can then be combined with the contents of register 830 using a simple multiplication instruction. The result is stored in register 850. First part 860 contains the product of the first part of register 830 and the first part of register 840. Second part 870 contains the product of the second part of register 830 and the second part of register 840. The multiplication of matrix [G_(N×)] with the previous results can be accomplished using 16 operations plus some additions.

[0072] The result following stage 540 (FIG. 5) will be a one-dimensional vector of length N×N. The one-dimensional vector result is then converted into a matrix using M, an operation that converts a vector into a matrix according to the equation [X₂₂]= M([x₀₀ x₀₁ x₁₀ x₁₁]) (stage 550). The result is then multiplied by the transpose of the unity matrix, U, which contains as entries only 1, 0, or −1 (stage 560). Multiplication by U, therefore, may by accomplished by addition and subtraction. The result is then transposed (stage 565) and multiplied a second time by the transpose of the unity matrix, U, to obtain a matrix of pixel information (stage 570). Pixel coefficients are then output (stage 580).

[0073]FIG. 9 shows the stages of implementing another method of computing the IDCT using a media processor with partitioned SIMD architecture based on Equation 6. FIG. 10 shows the use of a partitioned SIMD architecture in implementing principles consistent with the present invention. FIG. 11 is a signal flow diagram (also known as a “butterfly diagram”) of a fast IDCT algorithm to be performed by the IDCT apparatus of the present invention. In FIG. 11, input data flows from left to right. A diagonal line connecting two inputs indicates that the inputs are added together. An arrowhead indicates that the additive inverse of the result at the point of the arrow head is computed before the next calculation. The letter “C” in the box indicates that the result at the left end of the line segment is multiplied by a constant in a complex multiplication operation.

[0074] In Equation 6, below, matrices U, G, and H all contain constants. The matrices

[0075]  [f _(4×4) ]=[U _(4×4)]^(T)([U _(4×4)]^(T) M([G _(4×4,4×4) ][H _(4×4,4×4) ]L([P _(4×4)]^(T) [F _(4×4)]^(T)))^(T))^(T)  Equation 6

[0076]

[0077] G and H can therefore be combined and stored in memory prior to performance of this method. The product U_(4×4) ^(T)([U_(4×4)]^(T)) may also be computed earlier and stored in memory. Furthermore, the product U_(4×4) ^(T)([U_(4×4)]^(T)) will be also be a unity matrix, U′_(4×4), that contains all 0 and 1 entries.

[0078] The principles of the present invention, as described by Equation 6, may then be implemented in the following manner as shown in FIG. 9 with reference to FIGS. 10 and 11. In stage one, an N×N matrix of input components representing DCT coefficients, F, are received (stage 910). Assuming for the sake of this example that N equals 4, sixteen inputs (x₀₀, x₀₁, . . . x₃₃) are received as shown in FIG. 11. The input matrix, F, is reordered to prepare the input data for complex multiplication (stage 920). In FIG. 11, for example, the inputs (x₀₀, x₀₁, . . . x₃₃) are shown already reordered so that they may be easily grouped into pairs.

[0079] Returning now to FIG. 9, the reordered input data is then combined with the constant matrix G*H (stage 930). In a media processor with partitioned SIMD architecture and a complex multiply instruction, this multiply may be performed using one instruction. For example, as shown in FIG. 10, the quantities H_(ij) *G_(ij) and H_(ij+1)*G_(ij+1) may be packed into register 810 while the quantities F_(u,v) and F_(u+1,v) are packed into register 820. The contents of register 810 and register 820 are combined and the result is stored in register 830. In a media processor containing a single instruction for performing complex multiplication, as described above and illustrated in FIG. 5, the quantities H*G and F may be combined using the single complex instruction. As displayed in register 830, the first part of register 830 contains the product of the first parts of registers 810 and 820 minus the product of the second parts. The second part 850 of register 830 contains the product of the first parts plus the products of the second parts. The multiplication of H*G*F in this manner as shown in FIG. 10 can be done using 16 complex operations.

[0080] Referring now to FIG. 11, the first stage illustrates an implementation of a complex multiplication on the reordered data. In the second stage, the data constituting the results following stage 930 (FIG. 9) is then reordered by transposition (stage 940). The transposed data is then multiplied by the transpose of the unity matrix, U (Stage 950). As explained earlier, the unity matrix contains as entries only 1, 0, or −1. Multiplication by U, therefore, may by accomplished by addition and subtraction. FIG. 11 indicates the addition and subtraction with butterfly operations. The result is transposed (stage 952) and multiplied by U transpose (stage 954). The resulting pixel information is output to the next apparatus (stage 970).

[0081] The implementation illustrated by FIGS. 9, 10, and 11 for N=4, for example, requires 16 complex multiplications (each involving 2 multiplications and an addition) plus two additional simple multiplications. The total number of instructions using principles of the present invention is 50, a significant improvement over the 112 instructions using only a type I algorithm implementation and 92 instructions for type II algorithm implementation.

[0082] C. System

[0083]FIG. 12 shows an apparatus for performing a two-dimensional IDCT consistent with the present invention. As shown in FIG. 12, the IDCT apparatus 1210 comprises a memory 1220 and arithmetic logic unit (ALU) 1230. ALU 1230 is a processor capable of receiving inputs and performing arithmetic and logical operations on the received data. As shown in FIG. 12, ALU 1230 may comprise one or more multiplier circuits 1232 and one or more addition/subtraction circuits 1234. The memory may be a read-only memory (ROM) that stores constant coefficients that may be input to multiplier circuit 1232.

[0084] Furthermore, the principles of the present invention may be implemented using a system as shown in FIG. 13. As shown in FIG. 13, system 1300 contains a processor 1310 connected to at least one input/output (I/O) device 1320 via any suitable system bus 1360. I/O device 1320 can be any device capable of passing information to or receiving data from processor 1310. By way of example only, I/O device 1320 may be a digital camcoder connected through IEEE 1394 interface. Processor 1310 may be any commonly available processor such as, for example, a Pentium. Faster processors, however, will, decrease execution time of the invention.

[0085] The system of the present invention also includes memory 1330, which may store the data being processed by processor 1310 and the data being sent to or received from I/O device 1320. Processor 1310, I/O device 1320, and memory 1330 are connected via standard system bus 1360. FIG. 13 shows an exemplary network where each hardware component may be implemented by conventional, commercially available computer systems components.

[0086] D. Conclusion

[0087] Methods and apparatus consistent with the present invention may be implemented in software, hardware, or a combination of hardware and software. Software implementations of the invention are preferably embodied in a computer-readable media, such as a magnetic disk, or transferred over computer-readable media, such as the Internet.

[0088] It will be apparent to those skilled in the art that various modifications and variations can be made in the methods and systems consistent with the present invention without departing from the spirit or scope of the invention. For example, the DCT matrix is orthogonal and therefore its inverse is its transpose. Any matrix calculation performed for the IDCT may be easily transformed into a comparable method suitable for use in calculating a DCT. The true scope of the claims is defined by the following claims. 

We claim:
 1. A method for performing a two-dimensional inverse discrete cosine transform, performed by a processor which generates intermediate values, comprising the stages of: (a) receiving at least one input component representing discrete cosine transform data; (b) combining, in a first stage, the at least one input component with a first set of constants to obtain first-stage output data; (c) transposing the first-stage output data in a second stage; (d) combining, in a third stage, the transposed first-stage output data with a second set of constants, wherein all elements of the second set of constants are 0, 1, or −1; and (e) outputting at least one output component representing pixel information of an image.
 2. The method of claim 1 , wherein combining, in a first stage, the at least one input component includes: (b) multiplying using a complex multiplication instruction, in a first stage, the at least one input component with a first set of constants to obtain first-stage output data.
 3. A method for performing an inverse discrete cosine transform, performed by a processor which generates intermediate values, comprising the stages of: (a) receiving at least one input component representing discrete cosine transform data; (b) combining, in a first stage, the at least one input component with a first set of constants to obtain first-stage output data; (c) combining, in a second stage, the first-stage output data with a second set of constants to obtain second-stage output data; (d) transposing the second-stage output data in a third stage; (e) combining, in a fourth stage, the transposed second-stage output data with a third set of constants, wherein all elements of the second set of constants are 0, 1, or −1; and (f) outputting output components representing pixel information of an image.
 4. The method of claim 3 , wherein combining in a first stage includes: multiplying using a complex multiplication instruction the at least one input component with a first set of constants to obtain first-stage output data.
 5. The method of claim 3 , wherein combining, in a second stage, the first-stage output data includes: multiplying, in a second stage, the first-stage output data with a second set of constants to obtain second-stage output data.
 6. The method of claim 3 , wherein combining, in a third stage, includes: combining the transposed second-stage output data with a third set of constants using addition or subtraction.
 7. An IDCT apparatus comprising: an input means for receiving at least one input component representing discrete cosine transform data; a memory for storing a first and second set of constants, wherein all elements of the second set of constants are 0, 1, or −1; at least one circuit for: combining, in a first stage, the at least one input component with the first set of constants to obtain first-stage output data; transposing the first-stage output data in a second stage; and combining, in a third stage, the transposed first-stage output data with the second set of constants; and an output means for outputting output components representing pixel information of an image.
 8. The apparatus of claim 7 , wherein the at least one circuit further includes: circuit means for multiplying using a complex multiplication instruction, in a first stage, the at least one input component with the first set of constants to obtain first-stage output data.
 9. An IDCT apparatus comprising: an input means for receiving at least one input component representing discrete cosine transform data; a memory for storing a first, second, and third set of constants, wherein all elements of the third set of constants are 0, 1, or −1; at least one circuit for: combining, in a first stage, the at least one input component with the first set of constants to obtain first-stage output data; combining, in a second stage, the first-stage output data with the second set of constants to obtain second-stage output data; transposing the second-stage output data in a third stage; combining, in a fourth stage, the transposed second-stage output data with the third set of constants; and an output means for outputting output components representing pixel information of an image.
 10. The apparatus of claim 9 , wherein the at least one circuit includes: a multiplier circuit for multiplying using a complex multiplication instruction the at least one input component with a first set of constants to obtain first-stage output data.
 11. The apparatus of claim 9 , wherein the at least one circuit circuit includes: a multiplier circuit for multiplying, in a second stage, the first-stage output data with a second set of constants to obtain second-stage output data.
 12. The apparatus of claim 9 , wherein the at least one circuit includes: an adder or subtractor circuit for combining the transposed second-stage output data with a third set of constants using addition or subtraction.
 13. A system for performing a two-dimensional inverse discrete cosine transform comprising: (a) means for receiving at least one input component representing discrete cosine transform data; (b) means for combining, in a first stage, the at least one input component with a first set of constants to obtain first-stage output data; (c) means for transposing the first-stage output data in a second stage; (d) means for combining, in a third stage, the transposed first-stage output data with a second set of constants, wherein all elements of the second set of constants are 0, 1, or −1; and (e) means for outputting at least one output component representing pixel information of an image.
 14. The system of claim 13 , wherein means for combining, in a first stage, the at least one input component includes: (b) means for multiplying using a complex multiplication instruction, in a first stage, the at least one input component with a first set of constants to obtain first-stage output data.
 15. A system for performing an inverse discrete cosine transform comprises: (a) means for receiving at least one input component representing discrete cosine transform data; (b) means for combining, in a first stage, the at least one input component with a first set of constants to obtain first-stage output data; (c) means for combining, in a second stage, the first-stage output data with a second set of constants to obtain second-stage output data; (d) means for transposing the second-stage output data in a third stage; (e) means for combining, in a fourth stage, the transposed second-stage output data by a third set of constants, wherein all elements of the second set of constants are 0, 1, or −1; and (f) means for outputting output components representing pixel information of an image.
 16. The system of claim 15 , wherein means for combining in a first stage includes: means for multiplying using a complex multiplication instruction the at least one input component with a first set of constants to obtain first-stage output data.
 17. The system of claim 15 , wherein means for combining, in a second stage, the first-stage output data includes: means for multiplying, in a second stage, the first-stage output data with a second set of constants to obtain second-stage output data.
 18. The system of claim 15 , wherein means for combining, in a third stage, includes: means for combining the transposed second-stage output data with a third set of constants using addition or subtraction. 